Task Scheduling in Desktop Grids: Open Problems

Scheduling Task Parallel Applications For Rapid Turnaround on Desktop Grids

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xii

Adaptive energy efficient scheduling in Peer-to-Peer desktop grids

We address non-preemptive scheduling problems on heterogeneous P2P grids, where resources are changing over time, and scheduling decisions are free from information of application characteristics. We consider a scheduling with task replications to overcome possible bad resource allocation in presence of uncertainty, and ensure good performance. We analyze the energy consumption of job allocatio...

Scheduling with task replication on desktop grids: theoretical and experimental analysis

Our main objective in this paper is to study the possible benefits of using task replication when generating a schedule in a desktop grid. We consider the problem of constructing a schedule in an environment where machines’ speeds may be unpredictable and the objective is to minimize the makespan of the schedule. Another considered objective is to minimize the Total Processor Cycle Consumption ...

Using Open Source Desktop Grids in Scientific Computing and Visualization

Dynamic Decentralized Preemptive Scheduling across Heterogenous Multi-core Desktop Grids

The recent advent of multi-core computing environments increases the heterogeneity of grid resources and the complexity of managing them, making efficient load balancing challenging. In an environment where jobs are submitted regularly into a grid which is already executing several jobs, it becomes important to provide low job turn-around times and high throughput for the users. Typically, the ...